#include <bits/stdc++.h>
using namespace std;

vector<int> divby[60];
void build() {
  for (int i = 1; i < 60; ++i) {
    for (int j = 1; j <= i / j; ++j) {
      if (i % j == 0) {
        divby[i].push_back(j);
        if (j != i / j) divby[i].push_back(i / j);
      }
    }
    sort(divby[i].begin(), divby[i].end());
  }
}

int main() {
  int tc;
  cin >> tc;
  build();
  while (tc--) {
    int n, x, y;
    cin >> n >> x >> y;
    int diff = y - x;
    auto &v = divby[diff];
    for (int i = 0; i < v.size(); ++i) {
      int stride = v[i];
      int least_ele_num = 1 + diff / stride;
      if (least_ele_num > n) continue;
      int first = (y - stride * (n - 1));
      int second;
      if (first <= 0) {
        first = ((first % stride) + stride) % stride;
        if (first == 0) first = stride;  // 特判一下被模成0的情况，不优雅
        second = first + stride * (n - 1);
      } else {
        second = y;
      }
      for (int i = first; i <= second; i += stride) {
        cout << i << ' ';
      }
      cout << endl;
      break;
    }
  }
}
